The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
نویسندگان
چکیده
Let U(n, k) be the set of non-bipartite unicyclic graphs with n vertices and k pendant vertices, where n ≥ 4. In this paper, the unique graph with the minimal least eigenvalue of the signless Laplacian among all graphs in U(n, k) is determined. Furthermore, it is proved that the minimal least eigenvalue of the signless Laplacian is an increasing function in k. Let Un denote the set of non-bipartite unicyclic graphs on n vertices. As an application of the above results, the unique graph with the minimal least eigenvalue of the signless Laplacian among all graphs in Un is characterized, which has recently been proved by Cardoso, Cvetković, Rowlinson, and Simić.
منابع مشابه
Ela the Least Eigenvalue of the Signless Laplacian of Non-bipartite Unicyclic Graphs with K Pendant Vertices
Let U(n, k) be the set of non-bipartite unicyclic graphs with n vertices and k pendant vertices, where n ≥ 4. In this paper, the unique graph with the minimal least eigenvalue of the signless Laplacian among all graphs in U(n, k) is determined. Furthermore, it is proved that the minimal least eigenvalue of the signless Laplacian is an increasing function in k. Let Un denote the set of non-bipar...
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملOn the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum degree Δ, respectively.
متن کاملOrdering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
*Correspondence: [email protected] 1School of Mathematics and Statistics, Yancheng Teachers University, Yancheng, Jiangsu 224002, P.R. China Full list of author information is available at the end of the article Abstract A unicyclic graph is a connected graph whose number of edges is equal to the number of vertices. Fan et al. (Discrete Math. 313:903-909, 2013) and Liu et al. (Electron. J. Linear ...
متن کاملA sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected nonbipartite graph with a prescribed number of vertices is attained solely in the unicyclic graph obtained from a triangle by attaching a path at one of its endvertices. © 2008 Elsevier Inc. All rights reserved. AMS classification: 05C50
متن کامل